An efficient implementation of one-dimensional discrete wavelet transform algorithms for GPU architectures

نویسندگان

چکیده

Abstract In this paper, the authors present several self-developed implementation variants of Discrete Wavelet Transform (DWT) computation algorithms and compare their execution times against commonly approved ones for representative modern Graphics Processing Units (GPUs) architectures. The proposed solutions avoid time-consuming modulo divisions conditional instructions used DWT filters wrapping by proper expansion DWTs input data vectors. main goal research is to improve popular GPU architectures while retaining code’s clarity simplicity. relations between time improvements GPUs are also compared with counterparts traditional sequential processors. experimental study shows that implementations, in case parallel realization on GPUs, characterized very simple kernel code high performance.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An efficient architecture for two-dimensional discrete wavelet transform

This paper proposes an efficient architecture for the two-dimensional discrete wavelet transform (2-D DWT). The proposed architecture includes a transform module, a RAM module, and a multiplexer. In the transform module, we employ the polyphase decomposition technique and the coefficient folding technique to the decimation filters of stages 1 and 2, respectively. In comparison with other 2-D DW...

متن کامل

Two-Dimensional Discrete Wavelet Transform on Large Images for Hybrid Computing Architectures: GPU and CELL

The Discrete Wavelet Transform (DWT) has gained the momentum in signal processing and image compression over the last decade bringing the concept up to the level of new image coding standard JPEG2000. Thanks to many added values in DWT, in particular inherent multi-resolution nature, wavelet-coding schemes are suitable for various applications where scalability and tolerable degradation are rel...

متن کامل

Quantitative Dip Bounds for the Two-dimensional Discrete Wavelet Transform the Two-dimensional Discrete Wavelet Transform

An analysis of the discrete wavelet transform of dipping segments with a signal of given frequency band leads to a quantitative explanation of the known division of the two-dimensional wavelet transform into horizontal, vertical and diagonal emphasis panels. The results must be understood in a \fuzzy" sense: since wavelet mirror lters overlap, the results stated can be slightly violated with vi...

متن کامل

Recursive Algorithms for Realization of One- Dimensional Discrete Sine Transform and Inverse Discrete Sine Transform

In this paper, novel recursive algorithms for realization of one-dimensional discrete sine transform (DST) and inverse discrete sine transform (IDST) of any length are proposed. By using some mathematical techniques, recursive expressions for DST and IDST have been developed. Then, the DST and IDST are implemented by recursive filter structures. A linear systolic architecture for realization of...

متن کامل

A Reconfigurable Hardware Implementation of the One-Dimensional Discrete Wavelet Transform

—ASIC hardware implementations of the discrete wavelet transform are required to cope with the intensive real-time computations of the transform. In this paper, we describe a parallel implementation of the wavelet transform using one type of reconfigurable ASICs; Filed Programmable Gate Arrays (FPGAs). The implementation is based on reformulating the transform using the distributed arithmetic a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Journal of Supercomputing

سال: 2022

ISSN: ['0920-8542', '1573-0484']

DOI: https://doi.org/10.1007/s11227-022-04331-8